A comparison of the mathematical proof languages Mizar and Isar
نویسندگان
چکیده
The mathematical proof checker Mizar by Andrzej Trybulec uses a proof input language that is much more readable than the input languages of most other proof assistants. This system also differs in many other respects from most current systems. John Harrison has shown that one can have a Mizar mode on top of a tactical prover, allowing one to combine a mathematical proof language with other styles of proof checking. Currently the only fully developed Mizar mode in this style is the Isar proof language for the Isabelle theorem prover. In fact the Isar language has become the official input language to the Isabelle system, even though many users still use its low-level tactical part only. In this paper we compare Mizar and Isar. A small example, Euclid’s proof of the existence of infinitely many primes, is shown in both systems. We also include slightly higher-level views of formal proof sketches. Moreover a list of differences between Mizar and Isar is presented, highlighting the strengths of both systems from the perspective of end-users. Finally, we point out some key differences of the internal mechanisms of structured proof processing in either system.
منابع مشابه
Isabelle/Isar — a generic framework for human-readable proof documents
Isabelle/Isar is a generic framework for human-readable formal proof documents, both like and unlike Mizar. The Isar proof language provides general principles that may be instantiated to particular object-logics and applications. The design of Isar has emerged from careful analysis of some inherent virtues of the existing logical framework of Isabelle/Pure, notably composition of higherorder n...
متن کاملMizar Light for HOL Light
There are two different approaches to formalizing proofs in a computer: the procedural approach (which is the one of the HOL system) and the declarative approach (which is the one of the Mizar system). Most provers are procedural. However declarative proofs are much closer in style to informal mathematical reasoning than procedural ones. There have been attempts to put declarative interfaces on...
متن کاملProofPeer - A Cloud-based Interactive Theorem Proving System
Probably the most popular ITP systems these days are Isabelle [4a] and Coq [5]. Isabelle is a descendant of Edinburgh LCF. Its declarative extension Isabelle/Isar [4b] has been heavily influenced by Mizar. Coq can be viewed as a descendant of the Automath system in that both systems are based on the Curry-Howard correspondence [6] (a proof is a program, the formula it proves is a type for the p...
متن کاملA Guide to the Mizar Soft Type System∗
Introduction Mizar [1, 3] is in a way both typed and untyped. In a foundational sense, Mizar is based on untyped set theory. The set-theoretical world initially consists of many objects of “just one type”. However, the objects can have various properties (a number, ordinal number, complex number, Conway number, a relation, function, complex function, complex matrix), however none of them is con...
متن کامل